On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three
نویسنده
چکیده
We describe and analyse a simple greedy algorithm 2greedy that finds a good 2-matching M in the random graph G = G n,cn when c ≥ 10. A 2-matching is a spanning subgraph of maximum degree two and G is drawn uniformly from graphs with vertex set [n], cn edges and minimum degree at least three. By good we mean that M has O(log n) components. We then use this 2-matching to build a Hamilton cycle in O(n) time w.h.p..
منابع مشابه
An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three
We describe an algorithm for finding Hamilton cycles in random graphs. Our model is the random graph G = Gδ≥3 n,m. In this model G is drawn uniformly from graphs with vertex set [n], m edges and minimum degree at least three. We focus on the case where m = cn for constant c. If c is sufficiently large then our algorithm runs in O(n) time and succeeds w.h.p.
متن کاملGreed is Good for Deterministic Scale-Free Networks
Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. In fact, the behavior of real-world networks and random graph models can be the complete opposite of one another, depending on the considered property. Brach, Cygan, Lacki, and Sankowski [SODA 2...
متن کاملModels of random regular graphs
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are also presented, as well as various generalisations to random graphs with given degree sequence. A major feature in this area is the small subgraph conditioning method. When applicable, this establish...
متن کاملApproximation Bounds For Minimum Degree Matching
We consider the MinGreedy strategy for Maximum Cardinality Matching. MinGreedy repeatedly selects an edge incident with a node of minimum degree. For graphs of degree at most ∆ we show that MinGreedy achieves approximation ratio at least ∆−1 2∆−3 in the worst case and that this performance is optimal among adaptive priority algorithms in the vertex model, which include many prominent greedy mat...
متن کاملEdge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
Let Gn,m,k denote the space of simple graphs with n vertices, m edges and minimum degree at least k, each graph G being equiprobable. Let G have property Ak if G contains b(k − 1)/2c edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size bn/2c. For k ≥ 3, Ak occurs in Gn,m,k with probability tending to 1 as n →∞, when 2m ≥ ckn for some suitable constant ck. ∗...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 45 شماره
صفحات -
تاریخ انتشار 2014